A Constraint-Based Approach to Verification of Programs with Floating-Point Numbers

Software plays an important role in our daily lives. There is software in our cell phones, and in our workplaces, just to mention a few examples. We want reliable software. This is specially desired in critical software such as software in airplanes, software in medical applications, and software in nuclear plants. Software Validation and Verification help us to achieve reliable software. Verification refers to proving that a system satisfies its specifications. Constraint Programming is an emerging field and has been successfully used in scheduling problems and circuit designs among others. Its use in verification of software is still being researched and it is being applied to automatically generate test cases and to show the conformity of software to its specification. In this work, we survey constrained-based verification techniques and we propose a different approach to translate code construct where existing approaches made use of guarded constraints. In addition, we also describe a process to solve CSPs of the form ¬A ∧ B. COMMON VERIFICATION TECHNIQUES